Vertex Covering by Weighted Paths on Trees and its Subtree Variation
نویسندگان
چکیده
Given a tree and a set of weighted paths in that tree, the problem involves finding a minimum weighted subset of paths that covers all the vertices of the tree where each vertex is covered by a bounded number of paths, is scrutinized in this paper. This problem is referred to as the vertex covering by weighted paths on trees. All the necessary time and memory complexity with the algorithmic results of the aforementioned problem and its subtree variations are provided.
منابع مشابه
Two fixed-parameter algorithms for Vertex Covering by Paths on Trees
Vertex Covering by Paths on Trees with applications in machine translation is the task to cover all vertices of a tree T = (V,E) by choosing a minimum-weight subset of given paths in the tree. The problem is NP-hard and has recently been solved by an exact algorithm running in O(4 · |V |2) time, where C denotes the maximum number of paths covering a tree vertex. We improve this running time to ...
متن کاملVertex covering by paths on trees with its applications in machine translation
Given a tree and a set of paths in the tree, the problem of finding a minimum number of paths from the given path set to cover all the vertices in the tree is investigated in the paper. To distinguish from the classical path cover problem, such an optimization problem is referred to as vertex covering by paths. The problem and its edge variant, edge covering by paths, find applications in machi...
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملAn Optimal Algorithm for the Indirect Covering Subtree Problem
We consider the indirect covering subtree problem (Kim et al., 1996). The input is an edge weighted tree graph along with customers located at the nodes. Each customer is associated with a radius and a penalty. The goal is to locate a tree-shaped facility such that the sum of setup and penalty cost is minimized. The setup cost equals the sum of edge lengths taken by the facility and the penalty...
متن کاملInferring Optimal Species Trees Under Gene Duplication and Loss
Species tree estimation from multiple markers is complicated by the fact that gene trees can differ from each other (and from the true species tree) due to several biological processes, one of which is gene duplication and loss. Local search heuristics for two NP-hard optimization problems - minimize gene duplications (MGD) and minimize gene duplications and losses (MGDL) - are popular techniqu...
متن کامل